“Pyramiding: Efficient search for rare subjects”
نویسندگان
چکیده
منابع مشابه
AN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS
The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...
متن کاملSearch for the rare decays
J. P. Lees, V. Poireau, V. Tisserand, E. Grauges, A. Palano, G. Eigen, B. Stugu, D.N. Brown, L. T. Kerth, Yu. G. Kolomensky, G. Lynch, H. Koch, T. Schroeder, C. Hearty, T. S. Mattison, J. A. McKenna, R.Y. So, A. Khan, V. E. Blinov, A. R. Buzykaev, V. P. Druzhinin, V. B. Golubev, E. A. Kravchenko, A. P. Onuchin, S. I. Serednyakov, Yu. I. Skovpen, E. P. Solodov, K.Yu. Todyshev, A. N. Yushkov, D. ...
متن کاملSearch for the Rare Decay
Search for the Rare Decay KL ! 0e e A. Alavi-Harati, T. Alexopoulos, M. Arenton, R. F. Barbosa, A. R. Barker,* M. Barrio, L. Bellantoni, A. Bellavance, E. Blucher, G. J. Bock, C. Bown, S. Bright, E. Cheu, R. Coleman, M. D. Corcoran, B. Cox, A. R. Erwin, C. O. Escobar, R. Ford, A. Glazov, A. Golossanov, R. A. Gomes, P. Gouffon, J. Graham, J. Hamm, K. Hanagaki, Y. B. Hsiung, H. Huang, V. Jejer, D...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولEfficient Incremental Search for Moving Target Search
Incremental search algorithms reuse information from previous searches to speed up the current search and are thus often able to find shortest paths for series of similar search problems faster than by solving each search problem independently from scratch. However, they do poorly on moving target search problems, where both the start and goal cells change over time. In this paper, we thus deve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research Policy
سال: 2009
ISSN: 0048-7333
DOI: 10.1016/j.respol.2009.07.005